Linear approximation by primes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diophantine Approximation by Primes

We show that whenever δ > 0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality |λ0 + λ1p1 + λ2p2 + λ3p3| < (max pj)−2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector sieve method. 2000 Mathematics Subject Classification. 11D75, 11N36, 11P32.

متن کامل

On the Approximation of Pseudo Linear Systems by Linear Time Varying Systems (RESEARCH NOTE)

This paper presents a modified method for approximating nonlinear systems by a sequence of linear time varying systems. The convergence proof is outlined and the potential of this methodology is discussed. Simulation results are used to show the effectiveness of the proposed method.

متن کامل

Diophantine Approximation by Cubes of Primes and an Almost Prime

Let λ1, . . . , λs be non-zero with λ1/λ2 irrational and let S be the set of values attained by the form λ1x 3 1 + · · ·+ λsxs when x1 has at most 6 prime divisors and the remaining variables are prime. In the case s = 4, we establish that most real numbers are “close” to an element of S. We then prove that if s = 8, S is dense on the real line.

متن کامل

Approximation by pseudo-linear operators

The approximation operators provided by classical Approximation Theory use exclusively as underlying algebraic structure the linear structure of the reals. Also they are all linear operators. We address in the present paper the following problems: Need all the approximation operators be linear? Is the linear structure the only one which allows us to construct particular approximation operators?...

متن کامل

Approximation by sums of piecewise linear polynomials

We present two partitioning algorithms that allow a sum of piecewise linear polynomials over a number of overlaying convex partitions of the unit cube Ω in Rd to approximate a function f ∈ W 3 p (Ω) with the order N−6/(2d+1) in Lp-norm, where N is the total number of cells of all partitions, which makes a marked improvement over the N−2/d order achievable on a single convex partition. The gradi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1978

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700008984